BQP and PPAD
نویسنده
چکیده
We initiate the study of the relationship between two complexity classes, BQP (BoundedError Quantum Polynomial-Time) and PPAD (Polynomial Parity Argument, Directed). We first give a conjecture that PPAD is contained in BQP, and show a necessary and sufficient condition for the conjecture to hold. Then we prove that the conjecture is not true under the oracle model. In the end, we raise some interesting open problems/future directions. ISSN 1433-8092 Electronic Colloquium on Computational Complexity, Report No. 103 (2011)
منابع مشابه
Note on quantum counting classes∗
We define counting classes #BPP and #BQP as natural extensions of the classical well-studied one #P to the randomized and quantum cases. It is then shown that P#P = P#BQP.
متن کاملPPAD is not targeted as a citrullinated protein in rheumatoid arthritis, but remains a candidate for inducing autoimmunity
We thank Dr Quirke and colleagues for their interest in our study. We have some concerns, however, that the authors’ attempt to reconcile our work on Porphyromonas gingivalis peptidylarginine deiminase (PPAD) autocitrullination with their model of periodontal disease in rheumatoid arthritis (RA) misrepresents our data. 2 The discovery that citrullination is the primary antigenic determinant rec...
متن کاملPPAD is not targeted as a citrullinated protein in rheumatoid arthritis, but remains a candidate for inducing autoimmunity.
We thank Dr Quirke and colleagues for their interest in our study. We have some concerns, however, that the authors’ attempt to reconcile our work on Porphyromonas gingivalis peptidylarginine deiminase (PPAD) autocitrullination with their model of periodontal disease in rheumatoid arthritis (RA) misrepresents our data. 2 The discovery that citrullination is the primary antigenic determinant rec...
متن کاملQuantum Computation Relative to Oracles
The study of the power and limitations of quantum computation remains a major challenge in complexity theory. Key questions revolve around the quantum complexity classes EQP, BQP, NQP and their derivatives. This paper presents new relativized worlds in which (i) co-RP * NQE, (ii) P = BQP and UP = EXP, (iii) P = EQP and RP = EXP, and (iv) EQP * Σ 2 ∪Π P 2 . We also show a partial answer to the q...
متن کاملDirect Reduction of PPAD Linear Complementarity Problems to Bimatrix Games
It is well known that the problem of finding a Nash equilibrium for a bimatrix game (2-NASH) can be formulated as a linear complementarity problem (LCP). In addition, 2NASH belongs to the complexity class PPAD (Polynomialtime Parity Argument Directed). Based on the close connection between the graph associated with the Lemke algorithm, a vertex following algorithm for LCP, and the graph used to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 18 شماره
صفحات -
تاریخ انتشار 2011